An exact lexicographic approach for the maximally risk-disjoint/minimal cost path pair problem in telecommunication networks

Abstract The paper addresses the lexicographically maximal risk-disjoint/minimal cost path pair problem that aims at finding a of paths between two given nodes, which is shortest (in terms cost) among those have fewest risks in common. This particular importance telecommunication network design, namely concerning resilient routing models where both primary and backup to be calculated minimize risk failure connection origin terminal case along bandwidth costs should also minimized. An exact combinatorial algorithm proposed for solving this combines ranking method labelling algorithm. Also an integer linear programming (ILP) formulation shown comparison purposes. After theoretical justification foundations, described tested, together with ILP procedure, set reference networks telecommunications, considering randomly generated risks, associated Shared Risk Link Groups (SRLGs) arc costs. Both methods were capable instances relatively short times and, general, was clearly faster than excepting greatest dimension connectivity.